全文获取类型
收费全文 | 1277篇 |
免费 | 35篇 |
国内免费 | 87篇 |
专业分类
化学 | 5篇 |
晶体学 | 1篇 |
力学 | 20篇 |
综合类 | 16篇 |
数学 | 1152篇 |
物理学 | 205篇 |
出版年
2024年 | 3篇 |
2023年 | 11篇 |
2022年 | 17篇 |
2021年 | 9篇 |
2020年 | 15篇 |
2019年 | 19篇 |
2018年 | 25篇 |
2017年 | 27篇 |
2016年 | 21篇 |
2015年 | 11篇 |
2014年 | 27篇 |
2013年 | 101篇 |
2012年 | 66篇 |
2011年 | 53篇 |
2010年 | 37篇 |
2009年 | 70篇 |
2008年 | 81篇 |
2007年 | 78篇 |
2006年 | 72篇 |
2005年 | 55篇 |
2004年 | 52篇 |
2003年 | 43篇 |
2002年 | 50篇 |
2001年 | 48篇 |
2000年 | 50篇 |
1999年 | 43篇 |
1998年 | 33篇 |
1997年 | 30篇 |
1996年 | 26篇 |
1995年 | 16篇 |
1994年 | 21篇 |
1993年 | 18篇 |
1992年 | 20篇 |
1991年 | 15篇 |
1990年 | 13篇 |
1989年 | 10篇 |
1988年 | 13篇 |
1987年 | 15篇 |
1986年 | 10篇 |
1985年 | 9篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1982年 | 11篇 |
1981年 | 8篇 |
1980年 | 10篇 |
1979年 | 3篇 |
1978年 | 12篇 |
1977年 | 3篇 |
1976年 | 5篇 |
1974年 | 3篇 |
排序方式: 共有1399条查询结果,搜索用时 15 毫秒
61.
用一种统一的方式,讨论了线性规划问题中常用的罚函数方法及其对偶性.并将这种方法应用到等式约束二次规划问题中. 相似文献
62.
Wolfe Duality for Interval-Valued Optimization 总被引:1,自引:0,他引:1
H. C. Wu 《Journal of Optimization Theory and Applications》2008,138(3):497-509
Weak and strong duality theorems in interval-valued optimization problem based on the formulation of the Wolfe primal and
dual problems are derived. The solution concepts of the primal and dual problems are based on the concept of nondominated
solution employed in vector optimization problems. The concepts of no duality gap in the weak and strong sense are also introduced,
and strong duality theorems in the weak and strong sense are then derived. 相似文献
63.
Let E be a real reflexive Banach space having a weakly continuous duality mapping Jφ with a gauge function φ, and let K be a nonempty closed convex subset of E. Suppose that T is a non‐expansive mapping from K into itself such that F (T) ≠ ??. For an arbitrary initial value x0 ∈ K and fixed anchor u ∈ K, define iteratively a sequence {xn } as follows: xn +1 = αn u + βn xn + γn Txn , n ≥ 0, where {αn }, {βn }, {γn } ? (0, 1) satisfies αn +βn + γn = 1, (C 1) limn →∞ αn = 0, (C 2) ∑∞n =1 αn = ∞ and (B) 0 < lim infn →∞ βn ≤ lim supn →∞ βn < 1. We prove that {xn } converges strongly to Pu as n → ∞, where P is the unique sunny non‐expansive retraction of K onto F (T). We also prove that the same conclusions still hold in a uniformly convex Banach space with a uniformly Gâteaux differentiable norm or in a uniformly smooth Banach space. Our results extend and improve the corresponding ones by C. E. Chidume and C. O. Chidume [Iterative approximation of fixed points of non‐expansive mappings, J. Math. Anal. Appl. 318 , 288–295 (2006)], and develop and complement Theorem 1 of T. H. Kim and H. K. Xu [Strong convergence of modified Mann iterations, Nonlinear Anal. 61 , 51–60 (2005)]. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
64.
Radu Ioan Bo? Sorin-Mihai Grad 《Journal of Mathematical Analysis and Applications》2008,337(2):1315-1325
We give some necessary and sufficient conditions which completely characterize the strong and total Lagrange duality, respectively, for convex optimization problems in separated locally convex spaces. We also prove similar statements for the problems obtained by perturbing the objective functions of the primal problems by arbitrary linear functionals. In the particular case when we deal with convex optimization problems having infinitely many convex inequalities as constraints the conditions we work with turn into the so-called Farkas-Minkowski and locally Farkas-Minkowski conditions for systems of convex inequalities, recently used in the literature. Moreover, we show that our new results extend some existing ones in the literature. 相似文献
65.
Spacelike Willmore surfaces in 4-dimensional Lorentzian space forms, a topic in Lorentzian conformal geometry which parallels the theory of Willmore surfaces in S4, are studied in this paper. We define two kinds of transforms for such a surface, which produce the so-called left/right polar surfaces and the adjoint surfaces. These new surfaces are again conformal Willmore surfaces. For them the interesting duality theorem holds. As an application spacelike Willmore 2-spheres are classified. Finally we construct a family of homogeneous spacelike Willmore tori. 相似文献
66.
Conservative linear equations arise in many areas of application, including continuum mechanics or high-frequency geometrical optics approximations. This kind of equation admits most of the time solutions which are only bounded measures in the space variable known as duality solutions. In this paper, we study the convergence of a class of finite-difference numerical schemes and introduce an appropriate concept of consistency with the continuous problem. Some basic examples including computational results are also supplied.
67.
68.
O. Briant C. Lemaréchal Ph. Meurdesoif S. Michel N. Perrot F. Vanderbeck 《Mathematical Programming》2008,113(2):299-344
When a column generation approach is applied to decomposable mixed integer programming problems, it is standard to formulate
and solve the master problem as a linear program. Seen in the dual space, this results in the algorithm known in the nonlinear
programming community as the cutting-plane algorithm of Kelley and Cheney-Goldstein. However, more stable methods with better
theoretical convergence rates are known and have been used as alternatives to this standard. One of them is the bundle method;
our aim is to illustrate its differences with Kelley’s method. In the process we review alternative stabilization techniques
used in column generation, comparing them from both primal and dual points of view. Numerical comparisons are presented for
five applications: cutting stock (which includes bin packing), vertex coloring, capacitated vehicle routing, multi-item lot
sizing, and traveling salesman. We also give a sketchy comparison with the volume algorithm.
This research has been supported by Inria New Investigation Grant “Convex Optimization and Dantzig-Wolfe Decomposition”. 相似文献
69.
Qinghong Zhang 《Central European Journal of Operations Research》2008,16(2):205-213
Recently, a semidefinite and semi-infinite linear programming problem (SDSIP), its dual (DSDSIP), and uniform LP duality between
(SDSIP) and (DSDSIP) were proposed and studied by Li et al. (Optimization 52:507–528, 2003). In this paper, we show that (SDSIP)
is an ordinary linear semi-infinite program and, therefore, all the existing results regarding duality and uniform LP duality
for linear semi-infinite programs can be applied to (SDSIP). By this approach, the main results of Li et al. (Optimization
52:507–528, 2003) can be obtained easily. 相似文献
70.
We study the dual problems associated with the robust counterparts of uncertain convex programs. We show that while the primal robust problem corresponds to a decision maker operating under the worst possible data, the dual problem corresponds to a decision maker operating under the best possible data. 相似文献